TagIt: Tagging Network Flows using Blind Fingerprints
نویسندگان
چکیده
منابع مشابه
TagIt: Tagging Network Flows using Blind Fingerprints
Flow fingerprinting is a mechanism for linking obfuscated network flows at large scale. In this paper, we introduce the first blind flow fingerprinting system called TagIt. Our system works by modulating fingerprint signals into the timing patterns of network flows through slightly delaying packets into secret time intervals only known to the fingerprinting parties. We design TagIt to to enable...
متن کاملThe Need for Flow Fingerprints to Link Correlated Network Flows
Linking network flows is an important problem in the detection of stepping stone attacks as well as in compromising anonymity systems. Traffic analysis is an effective tool for linking flows, which works by correlating their communication patterns, e.g., their packet timings. To improve scalability and performance of this process, recent proposals suggest to perform traffic analysis in an activ...
متن کاملRobust And Invisible Non - Blind Watermark for Network Flows
The paper designs a new technique for correlating network flows, which they call RAINBOW. The core idea of RAINBOW is to slightly delay network packets in a way to modulate a secret signal, called the watermark signal, into the packet timings of network flows. The proposed technique is different from previous designs by being “non-blind”, i.e., the traffic analysis parties use a side channel to...
متن کاملBlind Clustering of Fingerprints for Database Indexing
WEI-HO TSAI, YEONG-YUH XU, JUN-HAO CHIEN AND WEN-TZENG HUANG Department of Electronic Engineering Graduate Institute of Computer and Communication Engineering National Taipei University of Technology Taipei, 106 Taiwan E-mail: {whtsai, 98418036}@ntut.edu.tw Department of Computer Science and Information Engineering Hungkuang University Taichung, 433 Taiwan E-mail: [email protected] Departm...
متن کاملNetwork Forensics on Packet Fingerprints
We present an approach to network forensics that makes it feasible to trace the content of all traffic that passed through the network via packet content fingerprints. We develop a new data structure called the “Rolling Bloom Filter” (RBF), which is based on a generalization of the Rabin-Karp stringmatching algorithm. This merges the two key advantages of space efficiency and an efficient conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings on Privacy Enhancing Technologies
سال: 2017
ISSN: 2299-0984
DOI: 10.1515/popets-2017-0050